Course contents: Introduction. Lists. Tables. Queues. Trees. Tree traversals. Priority queues. Binary search trees. AVL trees. Hashing. Sorting. Graphs. Skip lists. Union-find structures.

At the end of the course the student will be able to:

• describe the basic data structures and the operations that they support.
• describe the algorithms that allow the execution of the above operations and the computational resources that they require.
• implement data structures in C.
• select the appropriate data structures depending on the computational problem.

Assessment: Maximum of (Assignments with weight 30% and written exam with weight 70%, Written exam with weight 100%). Weights can vary ±10% depending on the difficulty of the assignments each year.